Resultaten visas 1 - 10 / 3266
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

The min-max edge q-coloring problem

Referentgranskad
DOI
10.7155/jgaa.00373
Larjomaa, Tommi; Popa, Alexandru
Journal of Graph Algorithms and Applications2015

Interactive Graph Algorithm Animator

Referentgranskad
Hirvisalo, V.; Malmi, L.; Nuutila, E.
Vaasa Institute of Technology1994

Compilation of algorithm-specific graph states for quantum circuits

Referentgranskad
Öppen tillgång
DOI
10.1088/2058-9565/ad1f39
Krishnan Vijayan, Madhav; Paler, Alexandru; Gavriel, Jason; Myers, Casey R.; Rohde, Peter P.; Devitt...
Quantum Science and Technology2024

Correlation-based Graph Smoothness Measures In Graph Signal Processing

Referentgranskad
Öppen tillgång
DOI
10.23919/EUSIPCO58844.2023.10289784
Miettinen, Jari; Vorobyov, Sergiy A.; Ollila, Esa; Wang, Xinjue
European Signal Processing Conference2023

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

Referentgranskad
Öppen tillgång
DOI
10.1145/3341731
Cairo, Massimo; Medvedev, Paul; Acosta, Nidia Obscura; Rizzi, Romeo; Tomescu, Alexandru I.
ACM transactions on algorithms2019

Integrated Factor Graph Algorithm for DOA-Based Geolocation and Tracking

Referentgranskad
Öppen tillgång
DOI
10.1109/ACCESS.2020.2979510
Cheng, Meng; Aziz, Muhammad Reza Kahar; Matsumoto, Tad
IEEE access2020

The Message Complexity of Distributed Graph Optimization

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.ITCS.2024.41
Dufoulon, Fabien; Pai, Shreyas; Pandurangan, Gopal; Pemmaraju, Sriram V.; Robinson, Peter
Leibniz International Proceedings in Informatics, LIPIcs2024

Constrained Multilinear Detection and Generalized Graph Motifs

Referentgranskad
Öppen tillgång
DOI
10.1007/s00453-015-9981-1
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
Algorithmica2016

A fast algorithm for the maximum clique problem

Referentgranskad
Östergård, Patric R.J.
Discrete Applied Mathematics2002

Large cliques in a power-law random graph

Referentgranskad
Öppen tillgång
DOI
10.1239/jap/1294170524
Janson, Svante; Łuczak, Tomasz; Norros, Ilkka
Journal of Applied Probability2010

The min-max edge q-coloring problem

Referentgranskad
DOI
10.7155/jgaa.00373
2015

Interactive Graph Algorithm Animator

Referentgranskad
1994

Compilation of algorithm-specific graph states for quantum circuits

Referentgranskad
Öppen tillgång
DOI
10.1088/2058-9565/ad1f39
2024

Correlation-based Graph Smoothness Measures In Graph Signal Processing

Referentgranskad
Öppen tillgång
DOI
10.23919/EUSIPCO58844.2023.10289784
2023

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

Referentgranskad
Öppen tillgång
DOI
10.1145/3341731
2019

Integrated Factor Graph Algorithm for DOA-Based Geolocation and Tracking

Referentgranskad
Öppen tillgång
DOI
10.1109/ACCESS.2020.2979510
2020

The Message Complexity of Distributed Graph Optimization

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.ITCS.2024.41
2024

Constrained Multilinear Detection and Generalized Graph Motifs

Referentgranskad
Öppen tillgång
DOI
10.1007/s00453-015-9981-1
2016

A fast algorithm for the maximum clique problem

Referentgranskad
2002

Large cliques in a power-law random graph

Referentgranskad
Öppen tillgång
DOI
10.1239/jap/1294170524
2010